A Wadge hierarchy for second countable spaces

نویسنده

  • Yann Pequignot
چکیده

Wadge reducibility provides a rich and nice analysis of Borel sets in Polish zero dimensional spaces. However, outside this framework, reducibility by continuous functions was shown to be ill behaved in many important cases. We define a notion of reducibility for subsets of a second countable T0 topological space based on the notions of admissible representations and relatively continuous relations. This reducibility can be seen as a generalisation of Wadge reducibility outside of the zero dimensional framework, in the sense that it agrees with Wadge reducibility on zero dimensional spaces. However this reducibility extends the nice properties of the Wadge reducibility far beyond the class of zero dimensional Polish spaces. In particular, on the real line R and on the Scott Domain P(ω) it is a semi wellorder on Borel sets and it refines the classical Borel classes and Kuratowski-Hausdorff difference hierarchies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixpoint alternation and the Wadge hierarchy

In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...

متن کامل

Transfinite Extension of the Mu-Calculus

In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...

متن کامل

On the Wadge reducibility of k-partitions

We establish some results on the Wadge degrees and on the Boolean hierarchy of k-partitions of some spaces, where k is a natural number. The main attention is paid to the Baire space, Baire domain and their close relatives. For the case of Δ2-measurable k-partitions the structures of Wadge degrees are characterized completely. For many degree structures, undecidability of the first-order theori...

متن کامل

Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank

We consider Borel sets of finite rank A C A'" where cardinality of A is less than some uncountable regular cardinal K5. We obtain a "normal form" of A, by finding a Borel set Q, such that A and Q continuously reduce to each other. In more technical terms: we define simple Borel operations which are homomorphic to ordinal sum. to multiplication by a countable ordinal, and to ordinal exponentiati...

متن کامل

Deciding the Borel Complexity of Regular Tree Languages

We show that it is decidable whether a given a regular tree language belongs to the class ∆2 of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Arch. Math. Log.

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2015